A Multiobjectivization Approach for Vehicle Routing Problems

نویسندگان

  • Shinya Watanabe
  • Kazutoshi Sakakibara
چکیده

In this chapter, we describe a new approach for vehicle routing problems (VRPs), which treats VRPs as multi-objective problems using the concept of multiobjectivization. The multiobjectivization approach has generated in the field of Evolutionary Multi-Criterion Optimization (EMO) (Knowles et al., 2001). This approach transforms a single-objective problem into a multi-objective problem. It is most important feature of this approach to provide more freedom to explore and to reduce the likelihood of becoming trapped in local optima by adding additional objectives. There have been many studies using EMO algorithm to optimize multi-objective VRPs, with objectives including the number of routes and total travel distance or number of routes and duration of routes, etc (Jozefowiez et al., 2002). In these studies, EMO treats the original objective of VRPs directly as multi-objective. On the other hand, our approach deals not only with the original objective of VRPs but also with newly defined objectives related to assignment of customers. Generally, VRPs seem to have two different determinations: the assignment of customers and the order of the route. The assignment of customers is known to have a stronger influence on the search than the order of the route in many studies (Doerner et al., 2005). Therefore, we expect that the proposed approach will get better solutions in minimization of the total travel distance than the approach using only the total travel distance as a single objective. In our approach, we add two new objective functions used by MOCK (Handl & Knowles, 2005) as the objective related to assignment of customers. Our multiobjectivization aims to accelerate the search for original objective by adding supplementary objective. We investigated the characteristics and effectiveness of the proposed approach by comparing the performance of the conventional approach and multiobjectivization approach. In numerical experiments, we used Taillard's test functions as a benchmark problem. In addition, we used NSGA-II (Deb et al., 2002) in implementing our approach. Through numerical examples, we showed that the proposed multiobjectivization approach can obtain the solution with good quality and little variation in VRPs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

متن کامل

Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...

متن کامل

A multi-criteria vehicle routing problem with soft time windows by simulated annealing

This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...

متن کامل

A goal programming model for vehicle routing problem with backhauls and soft time windows

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

متن کامل

A particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006